Algorithmic game theory

Probabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory

‎Given the importance of Markov chains in information theory‎, ‎the definition of conditional probability for these random processes can also be defined in terms of mutual information‎. ‎In this paper‎, ‎the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...

An algorithmic game theory framework for bilateral bargaining with uncertainty

Bilateral bargaining is the most common economic transaction. Customarily, it is formulated as a non-cooperative game with uncertain-information and infinite actions (offers are real-value). Its automation is a long-standing open problem in artificial intelligence and no algorithmic methodology employable regardless of the kind of uncertainty is provided. In this paper, we provide the first ste...

An Algorithmic Game Theory Primer∗

We give a brief and biased survey of the past, present, and future of research on the interface of theoretical computer science and game theory.

CS 700 : Computational Mechanism Design

[IMD] Introduction to mechanism design (for computer scientists), by N. Nisan. In N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors, Algorithmic Game Theory, chapter 9. Cambridge University Press, 2007. [CAs] Combinatorial Auctions, by L. Blumrosen and N. Nisan. In N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors, Algorithmic Game Theory, chapter 11. Cambridge Universit...

EVOLUTIONARY SOLUTIONS AND INTERNET APPLICATIONS FOR ALGORITHMIC GAME THEORY by